Firing squad synchronization problem in reversible cellular automata
نویسندگان
چکیده
منابع مشابه
Firing Squad Synchronization Problem in Reversible Cellular Automata
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). First we proved that, in the case of RCA, there is no solution under the usual condition for FSSP where the firing state is only one. So we defined a little weaker condition suitable for RCA in which finite number of firing states are allowed. We showed that Minsky’s ...
متن کاملFiring Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
We are given a network of identical processors that work synchronously at discrete time steps, a Cellular Automaton. Processors are arranged as an array of m rows and n columns with the constraint that they can exchange only one bit of information with their neighbours. We study the problem to synchronize the cellular automata, that is to let all the processors enter the same state for the rst ...
متن کاملA Trade-off in Firing Squad Synchronization Protocols for Communication-restricted Cellular Automata
Cellular automata (CA) are considered to be a good model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. In the long history of the study of CA, generally speaking, the number of internal states of each cell is finite and the local state transition rule is defined in a such w...
متن کاملA Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata and present a comparative stud...
متن کاملOn Optimal Solutions to the Firing Squad Synchronization Problem
The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular network made of a segment of n identical machines so that, whatever the length n of the segment is, 1. if, at the starting time (t = 1 in the following), all finite automata of the cellular network (called cells) are in a quiescent state L and no meaningful piece of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00016-3